Extracting optimal paths from roadmaps for motion planning
نویسندگان
چکیده
We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/dynamic constraints, or minimum clearance, and relaxed definitions of the goal state, to be used when selecting paths from roadmaps. Our algorithm is an augmented version of Dijkstra’s shortest path algorithm which allows edge weights to be defined relative to the current path. We present simulation results maximizing minimum path clearance, minimizing localization effort, and enforcing kinematic/dynamic constraints.
منابع مشابه
Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations
We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are computationally expensive. A large dense roadmap (graph) can typically ensure the existence of high quality solutions for most motion-planning problems, but the size of the roadmap, particularly in high-dimensional spac...
متن کاملPath Deformation Roadmaps: Compact Graphs with Useful Cycles for Motion Planning
This paper describes a new approach to sampling-based motion planning with PRMmethods. Our aim is to compute good quality roadmaps that encode the multiple connectedness of the configuration space inside small but yet representative graphs that capture well the different varieties of free paths. The proposed Path Deformation Roadmaps (PDR) rely on a notion of path deformability indicating wheth...
متن کاملOptimal motion planning for multiple robots having independent goals
This work makes two contributions to geometric motion planning for multiple robots: i) Motion plans are computed that simultaneously optimize an independent performance measure for each robot; ii) A general spectrum is deened between decoupled and centralized planning, in which we introduce coordination along independent roadmaps. By considering independent performance measures, we introduce a ...
متن کاملAnytime Geometric Motion Planning on Large Dense Roadmaps
For real-world robotic systems, the ability to efficiently obtain motion plans of good quality over a diverse range of problems, is crucial. Large, dense motion-planning roadmaps can typically ensure the existence of such good quality solutions for most problems. This thesis proposes an algorithmic framework for anytime planning on large, dense motion-planning roadmaps. The size of the roadmap ...
متن کاملOptimal Motion Planning for Multiple Robots Having Independent Goals - Robotics and Automation, IEEE Transactions on
This work makes two contributions to geometric motion planning for multiple robots: 1) motion plans are computed that simultaneously optimize an independent performance measure for each robot; 2) a general spectrum is defined between decoupled and centralized planning, in which we introduce coordination along independent roadmaps. By considering independent performance measures, we introduce a ...
متن کامل